Поиск по сайту

Information
По вашему запросу найдено материалов: 1
Искать:
Gotsulenko V. V. «Combinatorial numbers of the finite multiset partitions» // Applied Discrete Mathematics 2013. №4(22) C.67-72
Rybalov A. N. «On generic complexity of the problem of representation of natural numbers by sum of two squares» // Applied Discrete Mathematics 2020. №48 C.93-99
Rybalov A. N. «On generic complexity of decidability problem for diophantine systems in the Skolem's form» // Applied Discrete Mathematics 2017. №37 C.100-106
Rybalov A. N. «On generic undecidability of Hilbert's tenth problem for polynomial trees» // Applied Discrete Mathematics 2019. №44 C.107-112
Rybalov A.N. «On generic complexity of the problem to represent natural numbers by sum of two squares» // Applied Discrete Mathematics. Supplement 2020. №13 C.111-113